András Frank | |
---|---|
Born | 3 June 1949 Budapest |
Nationality | Hungary |
Fields | Mathematics |
Institutions | Eötvös Loránd University |
Alma mater | University of Szeged |
Doctoral advisor | László Lovász |
Doctoral students | András Sebő Éva Tardos |
András Frank (born 3 June 1949) is a Hungarian mathematician, working in combinatorics, especially in graph theory, and combinatorial optimisation. He is director of the Institute of Mathematics of the Eötvös Loránd University, Budapest.
Contents |
Using the LLL-algorithm, Frank, and his student, Éva Tardos developed a general method, which could transform some polynomial time algorithms into strongly polynomial.[1] He solved the problem of finding the minimum number of edges to be added to a given undirected graph so that in the resulting graph the edge-connectivity between any two vertices u and v is at least a predetermined number f(u,v).[2]
He received the Candidate of Mathematical Science degree in 1980, advisor: László Lovász,[3] and the Doctor of Mathematical Science degree (1990) from the Hungarian Academy of Sciences. He was awarded the Tibor Szele Prize of the János Bolyai Mathematical Society in 2002[4] and the Albert Szent-Györgyi Prize in 2009.[5] In June 2009 the ELTE Mathematical Institute sponsored a workshop in honor of his 60th birthday.[5][6]